Swarm Interpolation Using an Approximate Chebyshev Distribution
نویسندگان
چکیده
In this paper, we describe a novel swarming framework that guides autonomous mobile sensors into a flexible arrangement to interpolate values of a field in an unknown region. The algorithm is devised so that the sensor distribution will behave like a Chebyshev distribution, which can be optimal for certain ideal geometries. The framework is designed to dynamically adjust to changes in the region of interest, and operates well with very little a priori knowledge of the given region. For comparison, we interpolate a variety of nontrivial fields using a standard swarming algorithm that produces a uniform distribution and our new algorithm. We find that our new algorithm interpolates fields with greater accuracy.
منابع مشابه
Optimization of univariate functions on bounded intervals by interpolation and semidefinite programming
We consider the problem of minimizing a univariate, real-valued function f on an interval [a, b]. When f is a polynomial, we review how this problem may be reformulated as a semidefinite programming (SDP) problem, and review how to extract all global minimizers from the solution of the SDP problem. For general f , we approximate the global minimum by minimizing the Lagrange or Hermite interpola...
متن کاملNumerical Study of Unsteady Flow of Gas Through a Porous Medium By Means of Chebyshev Pseudo-Spectral Method
In this work, we first reformulate the unsteady flow of gas through a porous medium problem in [0,+∞) to a problem in [-1,1] by variable transformation μ = (x-s)/(x+s), and using spectral collocation method based on Chebyshev polynomials to approximate the resulting problem. The comparison of the results obtained by this method with results obtained by other methods shows that this method provi...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملSymbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation
We consider the problem of efficiently interpolating an “approximate” black-box polynomial p(x) that is sparse when represented in the Chebyshev basis. Our computations will be in a traditional floating-point environment, and their numerical sensitivity will be investigated. We also consider the related problem of interpolating a sparse linear combination of “approximate” trigonometric function...
متن کاملFinding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
When a function f(x) is holomorphic on an interval x ∈ [a, b], its roots on the interval can be computed by the following three-step procedure. First, approximate f(x) on [a, b] by a polynomial fN (x) using adaptive Chebyshev interpolation. Second, form the Chebyshev– Frobenius companion matrix whose elements are trivial functions of the Chebyshev coefficients of the interpolant fN (x). Third, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012